In DEA to obtain an efficient representation in CCR and BCC models for each DMU only one linear plan would be solved; however, it is possible in centralized Resource Allocation (CRA) to solve all the DMUs by one linear planning. In this paper, models of centralized Resource Allocation in input-oriented and in dynamic case will be offered and by using dynamic SBM, the representation of DMUs in each time period and in general and based on CRA in input oriented case will be obtained. After that, the theorems of the offered models will be shown and at least, an applicable example will be represented.

In this paper, downlink Resource Allocation for a sparse code multiple access (SCMA) based heterogeneous cellular networks (HCN) is investigated. The main aim of this paper is to obtain joint power Allocation and codebook assignment to achieve the least total system transmit power. In this regard, the proposed objective function is formulated as total transmit power subject to users minimum rate requirement, total available power in each base station (BS), and SCMA constraint. To solve the proposed problem an iterative algorithm considering successive convex approximation (SCA) is applied. Also, convergence of the iterative method is investigated. In the simulation results the effectiveness of proposed Resource Allocation method are shown.